搜索资源列表
NFAtoDFA
- NFA转化为DFA的一个程序!希望能有点作用!-NFA into a DFA procedures! Hope to some purpose!
Regular
- 输入一个正则表达式，可以使用： 小写字母或数字，表示终结符；*，闭包；+，并集；~，补集；E，空串；O，空集 然后程序将生成 相应的NFA，以及化简之后的DFA，最后再输入一个字符串，程序判断它是否满足该正则表达式-input is a regular expression, you can use : lowercase letters or numbers, said Fu end; * Closure; , And set; To complement the set; E, empty
shiyan2
- 本程序主要是使用“子集法”实现NFA的确定化，使用“分割法”实现DFA的最小化，在本程序中用到的主要的数据结构是数组，这些数组是用来存放NFA的初始状态集，及确定化和最小化后的状态矩阵。-This procedure is mainly the use of " sub-set method" to achieve the determination of NFA, the use of " segmentation" to achieve a minimum
LexicalAnalyzer
- 手工构造一个能够识别C语言的所有典型单词，如：标识符、数字、运算符，和if、while等保留字的确定有限自动机，并写出对应该自动机的程序；然后以一个简化的C语言程序为输入文件，通过所设计的基于上述自动机的词法分析程序获得输入文件中的各个单词及其内码对照表，并以文件形式保存结果（也就是TOKEN序列）。 将自己定义的各个正则表达式转化为NFA，然后将其综合为NFA ，再将NFA 转化为DFA，再将DFA转化为最少状态的DFA ，最后由DFA 转化为词法分析程序。-Manually constr
MorphlogyAnalysis_MrCompiler
- 基于Mac OS下的VIsual C++编程 实现词法分析器作用-Visal C++ Language to realize the functioon of DFA & NFA based on the os of MAC OS
function_dfa_nfa
- dfa to nfa conversion of automatons in pascal: Determinization+minimalization
-kk
- Convert from DFA to NFA
[NFAPTOPDFA]
- 这是一个将NFA转变成DFA的说明文档及部分程序说明。-This is an NFA into a DFA to the code, is a compilation of the work to the
new
- automata code for design dfa autmata and convert it to nfa
BY_work2
- 正则表达式转换成NFA最后转换成DFA~代码里注释的很清楚，希望能给大家帮助-Regular expressions to convert NFA finally converted into a DFA ~ code annotated clearly, I hope to give you help
DFA、NFA的java代码实现
- DFA、NFA的java代码实现，代码简单易懂，并附有可以运行的脚本文件，以及程序的说明文档-DFA, NFA' s java code, easy-to-understand code, with a scr ipt file that can be run, as well as the program' s documentation
NFAtoDFA
- 确定化NFA转换为DFA,自动机课程设计实例，txt格式源码-The Determination of NFA converted to DFA, automata course design examples txt format source
Compiler
- C# 词法分析 包含正规式到NFA NFA转换成DFA 以及DFA最小化 主要是对sample的词法分析-C# lexical analysis contains formal ceremony to NFA NFA converted to DFA and DFA minimization mainly on the sample of lexical analysis
Compile
- 编译原理，词法分析器的实现，可以读取pasal文件，进行词法分析，实现DFA，NFA，MFA的转换-Compiler theory, lexical analyzer to achieve, you can read pasal file for lexical analysis, implementation DFA, NFA, MFA conversion
NFA-DFA
- 设计题目：把NFA确定化为DFA 的算法实现 设计内容及要求：构造一程序，实现：将给定的NFA M(其状态转换矩阵及初态、终态信息保存在指定文件中)，确定化为DFA M’。（要先实现ε-CLOSURE函数和Ia函数）。输出DFA M’(其状态转换矩阵及初态、终态信息保存在指定文件中)。 -Design: the NFA into a DFA algorithm to determine the content and requirements of the design: structu
DFAaNFA
- 编译原理，判断一个字符串是否满足由DFA和NFA表示的正则表达式-Compiler theory, to determine whether a string meets represented by the DFA and NFA regex
aa
- 本代码是用VC把NFA正规式转成DFA，希望对大家有帮助。-This code is used to NFA regular formula VC turn into DFA, I want to help.
cciss_ioctl
- Executes a regular expression NFA DFA over a range using a variant of the parallel execution algorithm featured in the grep utility, modified to use Laurikari tags. -Executes a regular expression NFA DFA over a range using a variant of the paralle
main
- NFA machine to DFA machine
NFA-DFA-MFA
- 编译原理中从正规式转换到NFA,之后NFA-DFA-MFA三者之间的转换，支持打开文件与保存文件-Compile the transition formal to NFA, and then convert between NFA-DFA-MFA to support opening files and saving files